Computationally, tone is different

Tone: Is It Different?

Except for a brief period in the late 1970s and early 1980s, tone has generally fallen outside the central concerns of theoretical phonology. During that period, the concepts and formalisms of Goldsmith’s (1976a,b) autosegmental approach to tone provided the model to address other aspects of “non-linear phonology” including vowel harmony (Clements 1977, 1981), nasal harmony (Hyman 1982), and fe...

7 Tone : Is it Different ?

Except for a brief period in the late 1970s and early 1980s, tone has generally fallen outside the central concerns of theoretical phonology. During that period, the concepts and formalisms of Goldsmith’s (1976a, b) autosegmental approach to tone provided the model to address other aspects of non-linear phonology including vowel harmony (Clements 1976, 1981), nasal harmony (Hyman 1982), and fea...

(weak) Calibration is Computationally Hard

Consider a weather forecaster that predicts the probability of rain. The forecaster is said to be calibrated if every time she predicts a certain probability of rain, the empirical average of rainy vs. non-rainy days approaches this forecasted probability. This very natural property of forecasting was introduced by [Daw82] and has found numerous applications since [FV97, FV98, KLS99, Fos99, FL9...

A Computationally Universal Field Computer That is

A eld computer is a (spatial) continuum-limit neural net (MacLennan 1987). We investigate eld computers whose temporal dynamics is also continuum-limit, being governed by an integro-diierential equation. We prove that even when they are purely linear, such systems are computationally universal. The \trick" used to get such universal (and therefore in general nonlinear) behavior is quite similar...

What is Feasible , Infeasible , and Impossible , Computationally